n, k, q = map(int, input().split())
t = list(map(int, input().split()))
s = set()
l = [0] * k
c, m = 0, 0
for i in range(q):
x, y = map(int, input().split())
if x == 1:
c += 1
s.add(y)
l[0] = max(t[y - 1], l[0])
l.sort()
else:
if y not in s:
print("NO")
elif c < k:
print("YES")
elif t[y - 1] >= l[0]:
print("YES")
else:
print("NO")84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |